Overview of some general results in combinatorial enumeration
نویسنده
چکیده
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and hypergraphs, relational structures, and others. The second part advertises five topics in general enumeration: 1. counting lattice points in lattice polytopes, 2. growth of context-free languages, 3. holonomicity (i.e., P-recursiveness) of numbers of labeled regular graphs, 4. frequent occurrence of the asymptotics cn−3/2rn and 5. ultimate modular periodicity of numbers of MSOL-definable structures.
منابع مشابه
Half-Century Journey from Synthetic Organic Chemistry to Mathematical Stereochemistry through Chemoinformatics
My half-century journey started from synthetic organic chemistry. During the first stage of my journey, my interest in stereochemistry was initiated through the investigation on the participation of steric effects in reactive intermediates, cylophanes, strained heterocycles, and organic compounds for photography. In chemoinformatics as the next stage of the journey, I proposed the concept of im...
متن کاملType-Itemized Enumeration of RS-Stereoisomers of Octahedral Complexes
Stereoisograms of octahedral complexes are classified into five types (type I--typeV) under the action of the corresponding RS-stereoisomeric group. Their enumeration is accomplished in a type-itemized fashion, where Fujita's proligand method developed originally for combinatorial enumeration under point groups (S. Fujita, Theor. Chem. Acc., 113, 73--79 (2005)) is extended to meet the requireme...
متن کاملInjectivity in a category: an overview on smallness conditions
Some of the so called smallness conditions in algebra as well as in category theory, are important and interesting for their own and also tightly related to injectivity, are essential boundedness, cogenerating set, and residual smallness. In this overview paper, we first try to refresh these smallness condition by giving the detailed proofs of the results mainly by Bernhard Banaschewski and W...
متن کاملGenerating the Nine-Point Graphs
A program has been written which recently generated all the (unlabelled) nine-point graphs. Written in MACRO-10 assembly language and run on a 165K PDP10, it generates the complete set of 274,668 graphs in less than six hours. The algorithm on which this program is based is discussed with an emphasis on coding of graphs and various programming techniques designed to save space and time during e...
متن کاملAN INTRODUCTION TO HIGHER CLUSTER CATEGORIES
In this survey, we give an overview over some aspects of the set of tilting objects in an $m-$cluster category, with focus on those properties which are valid for all $m geq 1$. We focus on the following three combinatorial aspects: modeling the set of tilting objects using arcs in certain polygons, the generalized assicahedra of Fomin and Reading, and colored quiver mutation.
متن کامل